Codes, Cubes, and Graphical Designs
نویسندگان
چکیده
Graphical designs are an extension of spherical to functions on graphs. We connect linear codes graphical cube graphs, and show that the Hamming code in particular is a highly effective design. even structured distinct from related concepts extremal designs, maximum stable sets distance t-designs association schemes.
منابع مشابه
Some Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملsome designs and codes from l_2(q)
for $q in {7,8,9,11,13,16}$, we consider the primitive actions of $l_2(q)$ and use key-moori method 1 as described in [codes, designs and graphs from the janko groups {$j_1$} and{$j_2$}, {em j. combin. math. combin. comput.}, {bf 40} (2002) 143--159., correction to: ``codes, designs and graphs from the janko groups{$j_1$} and {$j_2$}'' [j. combin. math. combin. comput. {bf 40} (2002) 143--159],...
متن کاملThe (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملsome optimal codes from designs
the binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. a new method is also introduced to study optimal codes.
متن کاملUnitary designs and codes
A unitary design is a collection of unitary matrices that approximate the entire unitary group, much like a spherical design approximates the entire unit sphere. In this paper, we use irreducible representations of the unitary group to find a general lower bound on the size of a unitary t-design in U(d), for any d and t. We also introduce the notion of a unitary code — a subset of U(d) in which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Fourier Analysis and Applications
سال: 2021
ISSN: ['1531-5851', '1069-5869']
DOI: https://doi.org/10.1007/s00041-021-09852-z